1307B - Cow and Friend - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define ll          long long
#define lli         long long int
#define vl          vector<ll>
#define vi          vector<int>
#define vs          vector<string>
#define pi          pair<int,int>
#define pl          pair<ll,ll>
#define all(a)      a.begin(),a.end()
#define mem(a,x)    memset(a,x,sizeof(a))
#define pb          push_back
#define mp          make_pair
#define F           first
#define S           second
#define f(a,b) for(int i=a;i<b;i++)
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	int t;
	cin>>t;
	while(t--){
		int n,x;cin>>n>>x;
		set<int>s;
		for(int i=0;i<n;i++) {int x;cin>>x;s.insert(x);}
		if(s.find(x)!=s.end()){
			cout<<1<<endl;continue;
		}else{
				int maxi=*s.rbegin();
			cout<<max(2,(x+maxi-1)/maxi)<<endl;continue;
		}

	}
	return 0;
}